Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems

When solving nonlinear least-squares problems, it is often useful to regularize the problem using a quadratic term, a practice which is especially common in applications arising in inverse calculations. A solution method derived from a trust-region Gauss-Newton algorithm is analyzed for such applications, where, contrary to the standard algorithm, the least-squares subproblem solved at each ite...

متن کامل

Least Squares for Second Order Elliptic Problems

In this paper we introduce and analyze two least squares methods for second order elliptic di erential equations with mixed boundary conditions These methods extend to problems which involve oblique derivative boundary conditions as well as nonsym metric and inde nite problems as long as the original problem has a unique solution With the methods to be developed Neumann and oblique boundary con...

متن کامل

Simultaneous least squares deconvolution and kriging using conjugate gradients

Least squares deconvolution is a method used to sharpen tomographic images of the earth by undoing the bandlimiting effects imposed by a seismic wavelet. Kriging is a method used by geoscientists to extrapolate and interpolate sparse data sets. These two methodologies have traditionally been kept separate and viewed as unrelated fields of research. We demonstrate the connection between these me...

متن کامل

Backward Error Bounds for Constrained Least Squares Problems ∗

We derive an upper bound on the normwise backward error of an approximate solution to the equality constrained least squares problem minBx=d ‖b − Ax‖2. Instead of minimizing over the four perturbations to A, b, B and d, we fix those to B and d and minimize over the remaining two; we obtain an explicit solution of this simplified minimization problem. Our experiments show that backward error bou...

متن کامل

A reduced Newton method for constrained linear least-squares problems

We propose an iterative method that solves constrained linear least-squares problems by formulating them as nonlinear systems of equations and applying the Newton scheme. The method reduces the size of the linear system to be solved at each iteration by considering only a subset of the unknown variables. Hence the linear system can be solved more efficiently. We prove that the method is locally...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1991

ISSN: 0024-3795

DOI: 10.1016/0024-3795(91)90371-3